Piecewise convex function estimation: pilot estimators
نویسندگان
چکیده
منابع مشابه
Piecewise Convex Function Estimation: Pilot Estimators
Given noisy data, function estimation is considered when the unknown function is known a priori to consist of a small number of regions where the function is either convex or concave. When the number of regions is unknown, the model selection problem is to determine the number of convexity change points. For kernel estimates in Gaussian noise, the number of false change points is evaluated as a...
متن کاملPiecewise Convex Function Estimation: Representations, Duality and Model Selection
We consider spline estimates which preserve prescribed piecewise convex properties of the unknown function. A robust version of the penalized likelihood is given and shown to correspond to a variable halfwidth kernel smoother where the halfwidth adaptively decreases in regions of rapid change of the unknown function. When the convexity change points are prescribed, we derive representation resu...
متن کاملPiecewise convex estimation for signal processing
Traditional methods of nonparametric function estimation (splines, kernels and especially wavelet lters) usually produce arti cial features/spurious oscillations. Piecewise convex function estimation seeks to reliably estimate the geometric shape of the unknown function. We outline how piecewise convex tting may be applied to signal recovery, instantaneous frequency estimation, surface reconstr...
متن کاملDiscrete Piecewise Monotonic Approximation by a Strictly Convex Distance Function
Theory and algorithms are presented for the following smoothing problem. We are given n measurements of a real-valued function that have been altered by random errors caused by the deriving process. For a given integer k , some efficient algorithms are developed that approximate the data by minimizing the sum of strictly convex functions of the errors in such a way that the approximated values ...
متن کاملConvex piecewise-linear fitting
We consider the problem of fitting a convex piecewise-linear function, with some specified form, to given multi-dimensional data. Except for a few special cases, this problem is hard to solve exactly, so we focus on heuristic methods that find locally optimal fits. The method we describe, which is a variation on the K-means algorithm for clustering, seems to work well in practice, at least on d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 1997
ISSN: 0090-5364
DOI: 10.1214/aos/1030741086